On queues with service and interarrival times depending on waiting times
نویسندگان
چکیده
منابع مشابه
On queues with service and interarrival times depending on waiting times
W D = max{0, B − A + YW}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p = 0 it describes the waiting time of the server in an alternating service model. For all other values of p this model describes a FCFS queue in which the service times and interarrival times depend linearly and ...
متن کاملOn the waiting times in queues with dependency between interarrival and service times
In this paper a queueing system with partial correlation is considered. We assume that the amount of work (service time) brought in by a customer and the subsequent interarrival time are dependent. We show that in this case stronger dependence between interarrival and service times leads to decreasing waiting times in the increasing convex ordering sense. This generalizes a result of Chao (Oper...
متن کاملOn the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملOn Queues with Inter-Arrival Times Proportional to Service Times
We analyze a family of queueing systems where the interarrival time I n+1 between customers n and n + 1 depends on the service time B n of customer n. Speciically, we consider cases where the dependency between I n+1 and B n is a proportionality relation, and B n is an exponentially distributed random variable. Such dependencies arise in the context of packet-switched networks which use rate po...
متن کاملWaiting times in queues with relative priorities
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. © 2006 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2007
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-007-9011-3